The complete product of annihilatingly unique digraphs
نویسنده
چکیده
Let G be a digraph with n vertices and let A(G) be its adjacency matrix. A monic polynomial f (x) of degree at most n is called an annihilating polynomial of G if f (A(G)) = 0. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. Difans and diwheels are two classes of annihilatingly unique digraphs. In this paper, it is shown that the complete product of difan and diwheel is annihilatingly unique.
منابع مشابه
On Digraphs with Non-derogatory Adjacency Matrix
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similari...
متن کاملOn Annihilatingly Uniqueness of Directed Windmills
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if f(A(G)) = 0. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. In this paper, the directed windmill M3(r) is defined and we study the annihilating uniqueness of M3(r).
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملThe Iteration Digraphs of Lambert Map Over the Local Ring $mathbb{Z}/p^kmathbb{Z}$ : Structures and Enumerations
Let $p$ be prime and $alpha:x mapsto xg^x$, the Discrete Lambert Map. For $kgeq 1,$ let $ V = {0, 1, 2, . . . , p^k-1}$. The iteration digraph is a directed graph with $V$ as the vertex set and there is a unique directed edge from $u$ to $alpha(u)$ for each $uin V.$ We denote this digraph by $G(g, p^{k}),$ where $gin (mathbb{Z}/p^kmathbb{Z})^*.$ In this piece of work, we investigate the struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005